Detecting First Races using Trace and Replay for Parallel Programs with Random Synchronization

Debugging multithreaded or parallel programs is a hard problem due to unintended nondeterministic results of the program, called data races. Previous race detection techniques have limitations of coverage for synchronization constructs in detecting first races for parallel programs with random synchronizations. We present, in this paper, an efficient twopass algorithm to detect the first races in a particular execution of parallel program, by eliminating independent accesses to make a performance gain and candidate accesses, and then analyzing the traced information with candidate accesses by replaying the program. Therefore, our technique makes the race detection more practical in debugging parallel programs which have random synchronizations.